Generating Behaviour Networks from Finite-State Machines
نویسندگان
چکیده
This paper presents a novel approach for applying behaviour-based concepts at a high, deliberative layer of a robot control system. Complex tasks which a robot shall fulfil are typically specified using finite-state machines. It is shown here that behaviour-based systems can be used to implement such machines. This allows for realising complex tasks and at the same time benefit from the advantages of behaviour-based systems. A formal method for creating a behaviour network to a given Moore machine is described. The applicability of the presented concept is demonstrated using an example from the control system of a bucket excavator.
منابع مشابه
Restricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملFinite-State Computation in Analog Neural Networks: Steps towards Biologically Plausible Models?
Finite-state machines are the most pervasive models of computation, not only in theoretical computer science, but also in all of its applications to real-life problems, and constitute the best characterized computational model. On the other hand, neural networks —proposed almost sixty years ago by McCulloch and Pitts as a simplified model of nervous activity in living beings— have evolved into ...
متن کاملOn Test Case Generation from Asynchronously Communicating State Machines
This paper proposes an approach for generating test cases in Concurrent TTCN from a system of asynchronously communicating nite state machines. We give an algorithm for generating a noninterleaving model of prime event structures from a generalized model of asynchronously communicating nite state machines and deal with the generation of test cases from prime event structures.
متن کاملGenerating Tests for Control Portion of SDL Specifications
ABSTRACT The signal SAVE construct is one of the features distinguishing SDL from convent specification and programming languages. On the other hand, this feature increase testing SDL-specified software. We present a testing approach consisting of the foll SDL specifications are first abstracted into finite state machines with save constructs machines are transformed to equivalent finite state ...
متن کاملTest Selection Based on Communicating Nondeterministic Finite-State Machines Using a Generalized WP-Method
We present a method of generating test sequences for concurrent programs and communication protocols that are modeled as communicating nondeterministic finite state machines (CNFSMs). A conformance relation, called trace-equivalence, is defined within this model, serving as a guide to test generation. A test generation method for a single nondeterministic finite state machine (NFSM) is develope...
متن کامل